Automata That Take Advice Automata That Take Advice
نویسندگان
چکیده
Karp and Lipton introduced advice-taking Turing machines to capture nonuniform complexity classes. We study this concept for automata-like models and compare it to other nonuniform models studied in connection with formal languages in the literature. Based on this we obtain complete separations of the classes of the Chomsky hierarchy relative to advices.
منابع مشابه
Automata That Take Advice
Karp and Lipton introduced advice-taking Turing machines to capture nonuniform complexity classes. We study this concept for automata-like models and compare it to other nonuniform models studied in connection with formal languages in the literature. Based on this we obtain complete separations of the classes of the Chomsky hierarchy relative to advices.
متن کاملOne-Way Reversible and Quantum Finite Automata with Advice
• This Talk is about • The roles of advice that is given to one-way finite automata. • In particular, for reversible automata and quantum automata. • What is New? • A new characterization of reversible automata using advice. • A new necessary condition for quantum automata with advice. • New separations among advised language families • Why is This Result New? • This extends the existing framew...
متن کاملSwapping Lemmas for Regular and Context-Free Languages with Advice
Chomsky studied regular languages and context-free languages to develop his theory of formal languages. These languages are generated by restricted forms of grammars and also characterized by finite-state automata. Karp and Lipton examined roles of supplemental information given besides original inputs, under the term of “advice,” which depends only on the size of the inputs. We study the power...
متن کاملFinite Automata with Advice Tapes
We define a model of advised computation by finite automata where the advice is provided on a separate tape. We consider several variants of the model where the advice is deterministic or randomized, the input tape head is allowed real-time, one-way, or two-way access, and the automaton is classical or quantum. We prove several separation results among these variants, demonstrate an infinite hi...
متن کاملThe Roles of Advice to One-Tape Linear-Time Turing Machines and Finite Automata (Extended Abstract)
We discuss the power and limitation of various “advice,” when it is given particularly to weak computational models of one-tape linear-time Turing machines and one-way finite (state) automata. Of various advice types, we consider deterministically-chosen advice (not necessarily algorithmically determined) and randomly-chosen advice (according to certain probability distributions). In particular...
متن کامل